منابع مشابه
Random sampling: Billiard Walk algorithm
Hit-and-Run is known to be one of the best random sampling algorithms, its mixing time is polynomial in dimension. Nevertheless, in practice the number of steps required to achieve uniformly distributed samples is rather high. We propose new random walk algorithm based on billiard trajectories. Numerical experiments demonstrate much faster convergence to uniform distribution.
متن کاملDepth Map Up-Sampling Using Random Walk
For the high quality three-dimensional broadcasting, depth maps are important data. Although commercially available depth cameras capture highaccuracy depth maps in real time, their resolutions are much smaller than those of the corresponding color images due to technical limitations. In this paper, we propose the depth map up-sampling method using a high-resolution color image and a low-resolu...
متن کاملTowards Efficient Sampling: Exploiting Random Walk Strategies
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a propositional theory. We consider the question of whether state-of-the-art satisfiability procedures, based on random walk strategies, can be used to sample uniformly or nearuniformly from the space of satisfying assignme...
متن کاملTowards Efficient Sampling: Exploiting Random Walk Strategies
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a propositional theory. We consider the question of whether state-of-the-art satisfiability procedures, based on random walk strategies, can be used to sample uniformly or nearuniformly from the space of satisfying assignme...
متن کاملExpected Coverage of Random Walk Mobility Algorithm
Unmanned aerial vehicles (UAVs) have been increasingly used for exploring areas. Many mobility algorithms were designed to achieve a fast coverage of a given area. We focus on analysing the expected coverage of the symmetric random walk algorithm with independent mobility. Therefore we proof the dependence of certain events and develop Markov models, in order to provide an analytical solution f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2014
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2014.03.041